A Lexicalized Tree Ad- Joining Grammar for English. a Lexicalized Tree Adjoining Grammar for English. Automatic Acquisition of Datr Theories from Observations. Theories Des Lexicons: 6 Comparison with Related Work 5 Applying Lexical Rules
نویسندگان
چکیده
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to de ne an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redundancy otherwise associated with an LTAG lexicon.
منابع مشابه
Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierachy
This paper shows how DATR, a widely used formal language for lexical knowledge representation , can be used to define an I_TAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featu-ral encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redu...
متن کاملEncoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redunda...
متن کاملIn Proceedings ACL - 95 1 Encoding Lexicalized Tree Adjoining
This paper shows how DATR, a widely used formal language for lexical knowledge representation , can be used to deene an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as co-variation constraints within feature structures. Such an approach eliminates the considerable redund...
متن کاملAutomated Extraction of Tags from the Penn Treebank
The accuracy of statistical parsing models can be improved with the use of lexical information. Statistical parsing using Lexicalized tree adjoining grammar (LTAG), a kind of lexicalized grammar, has remained relatively unexplored. We believe that is largely in part due to the absence of large corpora accurately bracketed in terms of a perspicuous yet broad coverage LTAG. Our work attempts to a...
متن کاملLexicalized TAGs, Parsing and Lexicons
In our approach, each elementary structure is systematically associated with a lexical head. These structures specify extended domains of locality (as compared to a context-free grammar) over which constraints can be stated. These constraints either hold within the elementary structure itself or specify what other structures can be composed with a given elementary structure. The 'grammar' consi...
متن کامل